Determining transmission line path alternatives using a valley-finding algorithm
نویسندگان
چکیده
Since new (Power) Transmission Lines (TLs) can have a long-term effect on the makeup of landscape and human living space, it should be expected that route any TL will based objective criteria take into account views public. Geographic Information Science (GIScience) provides powerful tools assist in determination feasible locations for TLs georeferenced data by combining methods from Multi-Criteria Decision Analysis (MCDA) Least Cost Path (LCP) analysis. If such an approach is applied, LCP analysis usually yields one optimal result. However, stakeholders decision-makers prefer to compare multiple distinct path alternatives order find solution acceptable as many possible. We developed method calculates spatially Pareto same cost surface using algorithm determining valleys Digital Elevation Model (DEM) determine local low-cost points, which were then connected network graph geometrical rules. Finally, we selected all non-dominated represented conditions regarding specific main objective. asked ten expert cross-compare calculated assess our novel method. The concept applying linear programming obtain yielded routings mostly preferred over had greater likelihood being realized than results obtained conducting determined method's key useful assert high potential support planning, matter-of-fact argumentation, discussions about routing.
منابع مشابه
power transmission line routing using nsga-ii algorithm
using new approaches to optimize the process of power transmission line routing can solve many complex problems which power transmission line routing decision-makers are faced. due to the expansion of involved parameters we can consider multi-objective evolutionary algorithms as appropriate method in this area. in this thesis with using multi-objective evolutionary algorithms nsga-ii and offere...
متن کاملA More Eecient Path-finding Algorithm
In this paper, we present a new routing algorithm, which we call path-nding algorithm (PFA). It drastically reduces the possibility of temporary routing loops, which accounts for its fast convergence properties. Like other path-nding algorithms, PFA operates by specifying the second-to-last hop to each destination, in addition to the distance to the destination. A detailed proof of correctness ...
متن کاملA Path - Finding Algorithm for Loop - Free
| A loop-free path-nding algorithm (LPA) is presented ; this is the rst routing algorithm that eliminates the formation of temporary routing loops without the need for internodal synchronization spanning multiple hops or the speciication of complete or variable-size path information. Like other previous algorithms, LPA operates by specifying the second-to-last hop and distance to each destinati...
متن کاملA Loop - free Path - Finding Algorithm : Speci
The loop-free pathnding algorithm (LPA) is presented. LPA speci es the second-to-last hop and distance to each destination to ensure termination; in addition, it uses an inter-neighbor synchronization mechanism to eliminate temporary loops. A detailed proof of LPA's correctness is presented and its complexity is evaluated. LPA's average performance is compared by simulation with the performance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers, Environment and Urban Systems
سال: 2021
ISSN: ['0198-9715', '1873-7587']
DOI: https://doi.org/10.1016/j.compenvurbsys.2020.101571